Non-commutative proof construction: A constraint-based approach

Non-commutative proof construction: A constraint-based approach

This work presents a computational interpretation of the construction process for cyclic (CyLL) and non-commutative (NL) sequential proofs. We assume a proof construction paradigm, based on a normalisation procedure, known as focussing which manages efficiently the non-determinism of the construction. Similarly to the commutative case, a new formulation of focussing for NL is used to introduce ...

Constraint Based Proof Construction in Non-Commutative Logic

This work presents a computational interpretation of the construction process for cyclic (CyLL) and noncommutative (NL) sequential proofs. We assume a proof construction paradigm, based on a normalization procedure, known as focussing which manages eÆciently the non-determinism of the construction. Similarly to the linear case, a new formulation of focussing for NL is used to introduce a genera...

Constraint Based Proof Constru tion in Non - Commutative Logi

Concurrent Constraint Programming and Non-commutative Logic

This paper presents a connection between the intuitionis-tic fragment of a non-commutative version of linear logic introduced by the rst author (NLI) and concurrent constraint programming (CC). We reene existing logical characterizations of operational aspects of CC, by providing a logical interpretation of ner observable properties of CC programs, namely stores, successes and suspensions.

A Constraint-Based Approach for Computational Lexicon Construction

Ontologies are the central component for the Semantic Web, since they can be used to explicitly represent the semantics of structured or semistructured information. In this paper, we describe the recent developments of a lexical ontology named the TCL's computational lexicon, which aims to serve as the core knowledge base for the Semantic Web. We focus on designing a new specification of the se...